complete graph
英 [kəmˈpliːt ɡræf]
美 [kəmˈpliːt ɡræf]
网络 完全图; 完全圖; 完全无向图; 完备图; 完全图形
双语例句
- The complete graph algorithm is advanced and it combines complete graph algorithm and four level forecast model to perform whole EMC analysis in electronic information system which has less radio.
提出完全图算法，并将完全图算法和经典的四级预测模型结合使用，进行了小规模电台数目电子信息系统的完整的电磁兼容性分析，完成了系统内的频率指配。 - The Application of Weighted Complete Graph Aggregation in CIS
基于权重的完全图聚类在企业信息系统的应用 - Research on Algorithms for Association Rules Based on Granular Computing and Complete Graph
基于粒计算与完全图的关联规则算法研究 - An orientation of a complete graph is called a tournament.
完全图的定向图称为竞赛图。 - Anson, you know him better than some of the rest of us. Congruence Classes of Minimum Coverings of Complete Graph with Even Length Cycle
安逊，你比我们其余的人同他更熟些。偶圈对完全图最小覆盖的若干同余类 - Improved Complete Graph Algorithm of Solve Frequency Assignment Problem
求解频率指配问题改进的完全图算法 - Methods of Decomposing a Complete Graph K_ ( 2n+ 1) into n Edge Disjoint Hamiltonian Cycles
完全图K（2n+1）的n个H圈的分解方法 - 2-factorization of complete graph K_v and cycle colouring
完全图Kv的2因子分解与圈着色 - Up to isomorphism, there is just one complete graph on vertices.
在同构意义下，几个顶点的完全图只有一个。 - The edge coloring of complete graph satisfying the two-color P_4
满足2色P4条件完全图的边着色 - An improved algorithm for mining association rules with multiple minimum supports using maximum constraints based on complete graph is put forward.
提出了基于完全图的最大约束条件下多支持度阈值关联规则挖掘改进算法。 - Level diagram example shows the practicality and effectiveness of the construction theorem and counting theorem, which is a simple and easy method to construct a complete graph of the spanning tree.
平图例子验证了构造定理和计数定理的实用性和有效性，是构造一个完全图的生成树的简单易行的方法。 - Congruence Classes of Minimum Coverings of Complete Graph with Even Length Cycle
偶圈对完全图最小覆盖的若干同余类 - Adjacent Vertex-distinguishing E-total Coloring on the Multiple Join Graphs of Fan, Wheel and Complete Graph
扇、轮和完全图的多重联图的邻点可区别E-全染色 - Asymptotic Upper Bounds for Wheel: Complete Graph Ramsey Numbers
对于轮和完全图的Ramsey数的渐近上界 - We denote by K_n the complete graph on n vertices.
Kn表示n个顶点的完全图。 - The relation between the Roman domination numbers of graph G and its complement graph was studied. The Roman domination number of the complement of the complete graph and multi-complete graph was obtained.
利用图论的方法研究了图G同其补图-G的Roman控制数，得到了完全图和完全多部图的补图的Ro-man控制数及图G同其补图G-的Roman控制数的关系； - Series-parallel graphs. the complete graph of order 4 and graphs with small tree-width
系列并行图、4阶完全图与小树宽图 - Let K n be the complete graph with order n.
设Kn是n个顶点的完全图。 - The Algorithm and Implementation of Complete Graph
有关完全图的算法及实现技术 - In the paper, we discuss two important authentication schemes used in network security: authentication schemes for dynamic conferences and authentication schemes for computer networks with topology which is not the complete graph.
本文研究了网络安全中重要的两类认证系统：动态会议认证系统，以及网络拓扑结构不是完全图的认证系统&通信图认证系统。 - The crossing numbers of the complete bipartite graph and the complete graph are open problems in topological graph theory.
完全图的交叉数，完全二分图的交叉数都是拓扑图论中公开的难题。 - Because only the triangle matrix information is encoded in the symmetric matrix that describes all possible changes of the undirected network, the length of coding string is moderate and there is no limitation of edges for modeling the whole evolution from the tree to complete graph.
该编码方法只记录对称邻接矩阵中三角阵的信息，反映了无向网络的所有可能变化，因而编码串长度适中，网络边数不需限制，可以模拟网络从树到完备图的整个演化过程。 - By using of the characters of safe Petri nets, a place invariant generation algorithm which uses the reachability tree of safe Petri nets and complete graph of mth order with self-loop is presented.
利用安全Petri网的特点，提出一种由安全Petri网可达树和带自环的m阶完全图来计算位置不变式的生成算法。 - Various colorings for edges of the complete graph K 313 were studied using constructive method. New lower bounds of three 3-color classical Ramsey numbers were obtained: R ( 3,3,17)≥ 314, R ( 3,4,14)≥ 314, R ( 3,6,9)≥ 314.
用构造的方法研究了多色完全图K313的边的各种染色方法，得到了3个经典3色Ramsey数的新下界：R（3,3,17）≥314，R（3,4,14）≥314，R（3,6,9）≥314。 - The idea of global optimization is introduced into the problem of finding the minimum spanning trees of ( undirected) complete graph, then the Global optimization algorithm is represented in the paper.
将GlobalOptimization思想引入到寻找无向完全图最小生成树的问题中，提出了GlobalOptimization算法。 - A contour tracking algorithm with simultaneous edge feature detection is proposed and the character contour is separated from the complete graph contour of the scanned image based on rules.
提出了同步边缘特性检测的轮廓跟踪算法，并基于规则从扫描图像全图轮廓中分离字符轮廓； - The system makes full use of the complete graph functions, consistent interface and simplification of Windows.
本系统充分利用了Windows图形功能完备、界面一致性好、易学易用的特点。 - This paper proposed a new parallel adaptive deterministic algorithm without memory conflicts based on EREW-SIMD shared memory model by use of complete graph and Euclidean minimum spanning tree, with cost of O ( n2).
本文通过利用完全图求欧几里德最小生成树算法和无存储冲突的连通分支确定算法，提出一种基于EREW-SIMD共享存储模型的无存储冲突并行层次聚类算法，其成本为O（n2）。 - Secondly, the whole undirected complete graph is divided into several complete subgraphs based on the weight.
然后，基于边的权值将整个无项完全图拆分成若干完全子图。